To Find Energy Efficient Protocol by using Minimum Spanning Tree
نویسندگان
چکیده
منابع مشابه
How to Find a Minimum Spanning Tree in Practice
We address the question of theoretical vs. practical behavior of algorithms for the minimum spanning tree problem. We review the factors that innuence the actual running time of an algorithm, from choice of language, machine, and compiler, through low-level implementation choices, to purely algorithmic issues. We discuss how to design a careful experimental comparison between various alternativ...
متن کاملUsing Distributed Learning Automata to Find Minimum Spanning Tree in Stochastic Graph
In this paper an algorithm based on distributed learning automata for finding minimum spanning tree in a stochastic graph when the weight density functions for the edges of the graph is unknown is propped. The proposed algorithm with the aid of distributed learning automata tries to find the minimum spanning tree with minimum number of sampling from the edges of the stochastic graph. Using simu...
متن کاملA New Efficient Technique to Construct a Minimum Spanning Tree
A minimum spanning tree of a weighted graph is a tree of the graph which contains all the vertices of the graph and the sum of weights of all its edges are minimum among all such possible trees of the graph. In this paper, we have proposed a new technique and its corresponding algorithm to construct the minimum spanning tree of a weighted graph. This new algorithm is based on the weight matrix ...
متن کاملImproved and Energy Efficient Olsr Protocol Using Spanning Tree in Manet
Mobile Adhoc Network is an autonomous and decentralized network. Its topology changes dynamically and message overhead is more due to its frequent change of topology in network. For reliable transmission there is need to design a network which overcomes these problems like; overhead, Link breakage, power consumption etc. In this paper an attempt is made to overcome above mentioned issues by dev...
متن کامل4 Minimum Spanning Tree
This first algorithm is quite simple. (Though this was probably known earlier, its proof can be found in Prof. Indyk’s 1999 paper “Sublinear Time Algorithms for Metric Space Problems”.) Let Dij denote the distance between a pair of points i and j, over m total points. The entries of Dij must satisfy the triangle inequality; additionally the matrix is symmetric. Note that the matrix size (i.e., ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2019
ISSN: 0975-8887
DOI: 10.5120/ijca2019919199